Security, Privacy, and Anonymization in Social Networks by B. K. Tripathy Kiran Baktha

Author:B. K. Tripathy,Kiran Baktha
Language: eng
Format: epub, pdf
Publisher: IGI Global

Local DFS Forest updating depends on two other algorithms TED (Two-clique Edge Deletion) and TEA (Two-clique Edge Addition). Before reading on these algorithms, note that edges are classified into two types namely forward and backward. Forward edges are those edges present in DFS forest F and backward edges are those not present in the DFS forest F but in graph G.

Two-Clique Edge Deletion (TED)

If we need to delete a backward edge, then we simply delete it from G and keep F unchanged because backward edges are not present in F. If we need to delete a forward edge, then a couple of steps must be followed. Suppose the edge to be delete is the edge uv in Figure 11 (a) where u is the parent of v and subtree[v] is the subtree rooted at v, then deleting edge uv will make subtree[v] detached from the tree. However, we can connect it back to the tree if backward edges are present. We can choose the nearest backward edge legally but we need to ensure that two vertices adjacent to a backward edge satisfy ancestor-descendant relation. In Figure 11 (a), we can reconnect wither subtree[v] via backward edge e1 or e2. Connecting through e1 will violate the ancestor-descendant relation for the adjacent vertices of e2 which can be observed in Figure 11 (b). Therefore, we connect via e2 to ancestor as shown in Figure 11 (c). The selected ancestor is denoted as,

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.